Practical engineering of hard spin-glass instances
نویسندگان
چکیده
منابع مشابه
Exact Ground Statesof Hard Ising Spin Glass
Whenstudyinggroundstatepropertiesof Isingspinglasses, thecomputationof exactground states,i.e., spincon gurations with exact ratherthanapproximateminimumenergy, is often desirable. The Ising model is oneof the mostcommonlyused,both for its simplicity and its accuracy in describingmany realworld systems.Whenwe refer to a spinglass in this chapter , wealwayshavetheIsingmodelin mind. The con gur...
متن کاملHard Instances of Hard Problems
This paper investigates the instance complexities of problems that are hard or weakly hard for exponential time under polynomial time many one reductions It is shown that almost every instance of almost every problem in exponential time has essentially maximal instance complexity It follows that every weakly hard problem has a dense set of such maximally hard instances This extends the theorem ...
متن کاملOn hard instances
Instance complexity was introduced by Orponen, Ko, Schh oning, and Watanabe 14] as a measure of the complexity of individual instances of a decision problem. Comparing instance complexity to Kolmogorov complexity, they introduced the notion of p-hard instances, and conjectured that every set not in P has p-hard instances. Whereas this conjecture is still unsettled, Fortnow and Kummer 6] proved ...
متن کاملSparse instances of hard problems
In this thesis, we use and refine methods of computational complexity theory to analyze the complexity of sparse instances, such as graphs with few edges or formulas with few constraints of bounded width. Two natural questions arise in this context: • Is there an efficient algorithm that reduces arbitrary instances of an NP-hard problem to equivalent, sparse instances? • Is there an algorithm t...
متن کاملGenerating Hard Satisfiable Scheduling Instances
We present a random generator of partially complete round robin timetables that produces exclusively satisfiable instances, and provide experimental evidence that there is an easy-hard-easy pattern in the computational difficulty of completing partially complete timetables as the ratio of the number of removed entries to the total number of entries of the timetable is varied. Timetables in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2016
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.94.012320